An approximation scheme for strip packing of rectangles with bounded dimensions

An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions

It is shown that for any positive E the strip-packing problem, i.e. the problem of packing a given list of rectangles into a strip of width 1 and minimum height. can be solled within I c 2: times the optimal height, in linear time, if the heights and widths of these rectangles are all bounded below by an absolute constant 2 >O. @ 1998 Elsevicr Science B.V. All rights reserved. K~YIYJY~/S: Strip...

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

We provide improved approximation algorithms for several rectangle tiling and packing problems RTILE DRTILE and d RPACK studied in the literature Most of our algorithms are highly e cient since their running times are near linear in the sparse input size rather than in the domain size In addition we improve the best known approximation ratios

Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width

We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width W with infinite height. The objective is to find a packing of these items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of 3/2 of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial...

Approximation Algorithms for Multiple Strip Packing

In this paper we study the Multiple Strip Packing (MSP) problem, a generalization of the well-known Strip Packing problem. For a given set of rectangles, r1, . . . , rn, with heights and widths ≤ 1, the goal is to find a non-overlapping orthogonal packing without rotations into k ∈ N strips [0, 1]× [0,∞), minimizing the maximum of the heights. We present an approximation algorithm with absolute...

An Approximation Scheme for Bin Packing with Conflicts